A NEW WITNESS IDENTITY FOR 11|p(11n + 6) PETER PAULE AND CRISTIAN-SILVIU RADU
نویسنده
چکیده
Let p(n) be the number of partitions of the positive integer n. A new q-series identity is presented which witnesses Ramanujan’s observation that 11|p(11n+6) for all n ≥ 0 at one glance. This identity can be derived in a natural way by applying an algorithm to present subalgebras of the polynomial ring K[z] as K[z]-modules.
منابع مشابه
The Andrews–Sellers family of partition congruences
In 1994, James Sellers conjectured an infinite family of Ramanujan type congruences for 2-colored Frobenius partitions introduced by George E. Andrews. These congruences arise modulo powers of 5. In 2002 Dennis Eichhorn and Sellers were able to settle the conjecture for powers up to 4. In this article, we prove Sellers' conjecture for all powers of 5. In addition, we discuss why the Andrews-Sel...
متن کاملPartition Analysis, Modular Functions, and Computer Algebra
This article describes recent developments connecting problems of enumerative combinatorics, constrained by linear systems of Diophantine inequalities, with number theory topics like partitions, partition congruences, and q-series identities. Special emphasis is put on the role of computer algebra algorithms. The presentation is intended for a broader audience; to this end, elementary introduct...
متن کاملInfinite Families of Strange Partition Congruences for Broken 2-diamonds
In 2007 George E. Andrews and Peter Paule [1] introduced a new class of combinatorial objects called broken k-diamonds. Their generating functions connect to modular forms and give rise to a variety of partition congruences. In 2008 Song Heng Chan proved the first infinite family of congruences when k = 2. In this note we present two non-standard infinite families of broken 2-diamond congruence...
متن کاملAn Algorithmic Approach to Ramanujan Congruences
δ|M ∏∞ n=1(1− q )δ = ∑∞ n=0 a(n)q n and three positive integers m, t, p, and which returns true if a(mn + t) ≡ 0 (mod p), n ≥ 0, or false otherwise. A similar algorithm for generating functions of the form ∏∞ n=1(1− q )1 (i.e. the case M = 1) has already been given in [3]. Our original plan was to implement that algorithm in order to prove some congruences from [1]. The algorithm we present her...
متن کاملPARITY RESULTS FOR BROKEN k–DIAMOND PARTITIONS AND (2k + 1)–CORES
In this paper we prove several new parity results for broken k-diamond partitions introduced in 2007 by Andrews and Paule. In the process, we also prove numerous congruence properties for (2k+1)-core partitions. The proof technique involves a general lemma on congruences which is based on modular forms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016